A spectral signature of breaking of ensemble equivalence for constrained random graphs
نویسندگان
چکیده
For random systems subject to a constraint, the microcanonical ensemble requires constraint be met by every realisation ("hard constraint"), while canonical only on average ("soft constraint"). It is known that for graphs topological constraints breaking of equivalence may occur when size graph tends infinity, signalled non-vanishing specific relative entropy two ensembles. We investigate what extent manifested through largest eigenvalue adjacency matrix graph. consider examples in dense regime: (1) fix degrees vertices (= degree sequence); (2) sum twice number edges). Example imposes an extensive local and lead equivalence. single global Our working hypothesis corresponds difference expected values under verify that, limit as between ensembles does not vanish vanishes (2). A key tool our analysis transfer method uses determine whether probabilistic estimates can carried over from ensemble, illustrates how prevent this being possible.
منابع مشابه
Signature submanifolds for some equivalence problems
This article concerned on the study of signature submanifolds for curves under Lie group actions SE(2), SA(2) and for surfaces under SE(3). Signature submanifold is a regular submanifold which its coordinate components are differential invariants of an associated manifold under Lie group action, and therefore signature submanifold is a key for solving equivalence problems.
متن کاملBreaking of Ensemble Equivalence in Networks.
It is generally believed that, in the thermodynamic limit, the microcanonical description as a function of energy coincides with the canonical description as a function of temperature. However, various examples of systems for which the microcanonical and canonical ensembles are not equivalent have been identified. A complete theory of this intriguing phenomenon is still missing. Here we show th...
متن کاملFast Constrained Spectral Clustering and Cluster Ensemble with Random Projection
Constrained spectral clustering (CSC) method can greatly improve the clustering accuracy with the incorporation of constraint information into spectral clustering and thus has been paid academic attention widely. In this paper, we propose a fast CSC algorithm via encoding landmark-based graph construction into a new CSC model and applying random sampling to decrease the data size after spectral...
متن کاملinvestigating the feasibility of a proposed model for geometric design of deployable arch structures
deployable scissor type structures are composed of the so-called scissor-like elements (sles), which are connected to each other at an intermediate point through a pivotal connection and allow them to be folded into a compact bundle for storage or transport. several sles are connected to each other in order to form units with regular polygonal plan views. the sides and radii of the polygons are...
ذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Communications in Probability
سال: 2021
ISSN: ['1083-589X']
DOI: https://doi.org/10.1214/21-ecp432